216 research outputs found

    Symposium on Event Predictive Cognition

    Get PDF
    This symposium on Event-Predictive Cognition (EPCog) will scrutinize the apparent strong linkage between events and predictions. Events, characterized as “a segment of time at a given location that is conceived by an observer to have a beginning and an end” (p.3, Zacks & Tversky, 2001), seem to be predictively encoded in our minds, linking and temporarily binding the essential aspects that constitute an event. However, in different disciplines the concept of an event as well as of predictions and predictive encodings has been treated from different perspectives and by means of different paradigms

    Learning Mazes with Aliasing States: An LCS Algorithm with Associative Perception

    Get PDF
    Learning classifier systems (LCSs) belong to a class of algorithms based on the principle of self-organization and have frequently been applied to the task of solving mazes, an important type of reinforcement learning (RL) problem. Maze problems represent a simplified virtual model of real environments that can be used for developing core algorithms of many real-world applications related to the problem of navigation. However, the best achievements of LCSs in maze problems are still mostly bounded to non-aliasing environments, while LCS complexity seems to obstruct a proper analysis of the reasons of failure. We construct a new LCS agent that has a simpler and more transparent performance mechanism, but that can still solve mazes better than existing algorithms. We use the structure of a predictive LCS model, strip out the evolutionary mechanism, simplify the reinforcement learning procedure and equip the agent with the ability of associative perception, adopted from psychology. To improve our understanding of the nature and structure of maze environments, we analyze mazes used in research for the last two decades, introduce a set of maze complexity characteristics, and develop a set of new maze environments. We then run our new LCS with associative perception through the old and new aliasing mazes, which represent partially observable Markov decision problems (POMDP) and demonstrate that it performs at least as well as, and in some cases better than, other published systems

    The Scared Robot: Motivations in a Simulated Robot Arm

    Full text link

    Searches for invisible decays of the Higgs boson in pp collisions at root S=7, 8, and 13 TeV

    Get PDF
    Peer reviewe

    Measurements of differential production cross sections for a Z boson in association with jets in pp collisions at root s=8 TeV

    Get PDF
    Peer reviewe

    Search for leptophobic Z ' bosons decaying into four-lepton final states in proton-proton collisions at root s=8 TeV

    Get PDF
    Peer reviewe

    Search for high-mass diphoton resonances in proton-proton collisions at 13 TeV and combination with 8 TeV search

    Get PDF
    Peer reviewe

    Search for heavy resonances decaying into a vector boson and a Higgs boson in final states with charged leptons, neutrinos, and b quarks

    Get PDF
    Peer reviewe
    corecore